Constructing convex 3-polytopes from two triangulations of a polygon
نویسندگان
چکیده
منابع مشابه
Counting Triangulations of a Convex Polygon
In a 1751 letter to Christian Goldbach (1690–1764), Leonhard Euler (1707–1783) discusses the problem of counting the number of triangulations of a convex polygon. Euler, one of the most prolific mathematicians of all times, and Goldbach, who was a Professor of Mathematics and historian at St. Petersburg and later served as a tutor for Tsar Peter II, carried out extensive correspondence, mostly ...
متن کاملEnumerating Triangulations of Convex Polytopes
A triangulation of a finite point set A in IRd is a geometric simplicial complex which covers the convex hull of A and whose vertices are points of A. We study the graph of triangulations whose vertices represent the triangulations and whose edges represent geometric bistellar flips. The main result of this paper is that the graph of triangulations in three dimensions is connected when the poin...
متن کاملThe complexity of finding small triangulations of convex 3-polytopes
The problem of finding a triangulation of a convex three-dimensional polytope with few tetrahedra is NP -hard. We discuss other related complexity results.
متن کاملMinimal Simplicial Dissections and Triangulations of Convex 3-Polytopes
This paper addresses three questions related to minimal triangulations of a three-dimensional convex polytope P. • Can the minimal number of tetrahedra in a triangulation be decreased if one allows the use of interior points of P as vertices? • Can a dissection of P use fewer tetrahedra than a triangulation? • Does the size of a minimal triangulation depend on the geometric realization of P? Th...
متن کاملAlgorithms for optimal area triangulations of a convex polygon
Given a convex polygon with n vertices in the plane, we are interested in triangulations of its interior, i.e., maximal sets of nonintersecting diagonals that subdivide the interior of the polygon into triangles. The MaxMin area triangulation is the triangulation of the polygon that maximizes the area of the smallest triangle in the triangulation. Similarly, the MinMax area triangulation is the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2004
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2004.01.006